Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem
نویسندگان
چکیده
In this paper we study the following problem, named Maximum Edges in Transitive Closure, which has applications in computational biology. Given a simple, undirected graph G = (V,E) and a coloring of the vertices, remove a collection of edges from the graph such that each connected component is colorful (i.e., it does not contain two identically colored vertices) and the number of edges in the transitive closure of the graph is maximized. The problem is known to be APX-hard, and no approximation algorithms are known for it. We improve the hardness result by showing that the problem is NP-hard to approximate within a factor of |V |1/3−ε, for any constant ε > 0. Additionally, we show that the problem is APX-hard already for the case when the number of vertex colors equals 3. We complement these results by showing the first approximation algorithm for the problem, with approximation factor √ 2 ·OPT.
منابع مشابه
The Effect of Transitive Closure on the Calibration of Logistic Regression for Entity Resolution
This paper describes a series of experiments in using logistic regression machine learning as a method for entity resolution. From these experiments the authors concluded that when a supervised ML algorithm is trained to classify a pair of entity references as linked or not linked pair, the evaluation of the model’s performance should take into account the transitive closure of its pairwise lin...
متن کاملParameterized Complexity and Approximation Issues for the Colorful Components Problems
The quest for colorful components (connected components where each color is associated with at most one vertex) inside a vertex-colored graph has been widely considered in the last ten years. Here we consider two variants, Minimum Colorful Components (MCC) and Maximum Edges in transitive Closure (MEC), introduced in the context of orthology gene identification in bioinformatics. The input of bo...
متن کاملThe Serial Transitive Closure Problem for Trees
The serial transitive closure problem is the problem of, given a directed graph G and a list of edges, called closure edges, which are in the transitive closure of the graph, to generate all the closure edges from edges in G . We give a nearly linear upper bound on the number of steps in optimal solutions to the serial transitive closure problem for the case of graphs which are trees. “Nearly l...
متن کاملTopological structure on generalized approximation space related to n-arry relation
Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...
متن کاملTransitive-Closure Spanners: A Survey
We survey results on transitive-closure spanners and their applications. Given a directed graph G = (V,E) and an integer k ≥ 1, a k-transitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V,EH) that has (1) the same transitive-closure as G and (2) diameter at most k. These spanners were studied implicitly in different areas of computer science, and properties of these spanners h...
متن کامل